package com.squirrel.michale;


import java.util.LinkedList;
import java.util.Queue;

/**
 * @author guanhao 观浩
 * @version 1.0.0.0
 * @createTime 2023/2/20 8:00 AM
 * @company Michale Squirrel
 * @link
 * @description
 */
public class LeetCode0662 {

    public int widthOfBinaryTree(TreeNode root) {

        if (root == null) {
            return 0;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);


        return 0;

    }
}
